Approximating Fault-Tolerant Group-Steiner Problems
نویسندگان
چکیده
In this paper, we initiate the study of designing approximation algorithms for FaultTolerant Group-Steiner (FTGS) problems. The motivation is to protect the well-studied group-Steiner networks from edge or vertex failures. In Fault-Tolerant Group-Steiner problems, we are given a graph with edge(or vertex-) costs, a root vertex, and a collection of subsets of vertices called groups. The objective is to find a minimum-cost subgraph that has two edge(or vertex-) disjoint paths from each group to the root. We present approximation algorithms and hardness results for several variants of this basic problem, e.g., edge-costs vs. vertex-costs, edge-connectivity vs. vertex-connectivity, and 2-connecting from each group a single vertex vs. two distinct vertices from each group. Main contributions of our paper include the introduction of general structural lemmas on connectivity and a charging scheme that may find more applications in the future. Our algorithmic results are supplemented by inapproximability results, which are tight in some cases. ∗IBM T.J.Watson Research Center. Email: [email protected] †Rutgers University, Camden. Email: [email protected] Partially supported by NSF grant 08129959 ‡The Open University of Israel. Email: [email protected]
منابع مشابه
Group-Strategyproof Cost Sharing for Metric Fault Tolerant Facility Location
In the context of general demand cost sharing, we present the first group-strategyproof mechanisms for the metric fault tolerant uncapacitated facility location problem. They are (3L)-budget-balanced and (3L · (1 +Hn))-efficient, where L is the maximum service level and n is the number of agents. These mechanisms generalize the seminal Moulin mechanisms for binary demand. We also apply this app...
متن کاملNew Results on Fault Tolerant Geometric Spanners
We investigate the problem of constructing spanners for a given set of points that are tolerant for edge/vertex faults. Let S IRd be a set of n points and let k be an integer number. A k-edge/vertex fault tolerant spanner for S has the property that after the deletion of k arbitrary edges/vertices each pair of points in the remaining graph is still connected by a short path. Recently it was sho...
متن کاملA Self-Stabilizing Distributed Algorithm for the Steiner Tree Problem
Self-stabilization is a theoretical framework of nonmasking fault-tolerant distributed algorithms. In this paper, we investigate the Steiner tree problem in distributed systems, and propose a selfstabilizing heuristic solution to the problem. Our algorithm is constructed by four layered modules (sub-algorithms): construction of a shortest path forest, transformation of the network, construction...
متن کاملVerification of Fault-Tolerant Clock Synchronization Algorithms
In this paper, we propose a benchmark for verification of properties of fault-tolerant clock synchronization algorithms, namely, a benchmark of a TTEthernet network, where properties of the clock synchronization algorithm as implemented in a TTEthernet network can be verified, and optimization techniques for verification purposes can be applied. Our benchmark, which assumes non-faulty component...
متن کاملBenchmark for Verification of Fault-Tolerant Clock Synchronization Algorithms
In this paper, we propose a benchmark for verification of properties of fault-tolerant clock synchronization algorithms, namely, a benchmark of a TTEthernet network, where properties of the clock synchronization algorithm as implemented in a TTEthernet network can be verified, and optimization techniques for verification purposes can be applied. Our benchmark, which assumes non-faulty component...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Theor. Comput. Sci.
دوره 416 شماره
صفحات -
تاریخ انتشار 2009